Partitioning triples and partially ordered sets
نویسندگان
چکیده
منابع مشابه
Partitioning Triples and Partially Ordered Sets
We prove that if P is a partial order and P → (ω)ω, then (a) P → (ω + ω + 1, 4)3, and (b) P → (ω +m,n)3 for each m,n < ω. Together these results represent the best progress known to us on the following question of P. Erdős and others. If P → (ω)ω, then does P → (α, n)3 for each α < ω1 and each n < ω?
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملPartially Ordered Sets
For example, thus far, I had the fortune to work intimately with nine (9) undergraduate students on research questions in the areas of computational algebra and algebraic geometry. I am directing two master’s students in their research for their theses at Sam Houston State University. All of these undergraduate students have enrolled in graduate programs around the country. Three have finished ...
متن کاملPartially ordered sets and stratification
We employ partially ordered sets to describe the stratification of a social system, using rank to define the strata. We present a simple method of computing the matrix corresponding to the Hasse diagram and prove its correctness. This methodology is applied to analyze the hierarchy of countries that have won at least one Olympic medal. Four different definitions of dominance are given, leading ...
متن کاملCompletion of Partially Ordered Sets
The paper considers a generalization of the standard completion of a partially ordered set through the collection of all its lower sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-07-09170-8